Locating Mobile Agents in a Wide Distributed System: A Dynamic Approach

نویسندگان

  • R. B. Patel
  • Nikos Mastorakis
چکیده

Managing location information of mobile agents (MAs) is an important issue in MA based mobile computing systems. There is a tradeoff between location update effort (when an agent moves) and agent finding effort. In this paper we present a dynamic location management strategy that has the following features: (i) all location servers (LSs) need not maintain location information of every MA, (ii) a coterie based approach is adopted for location update and find, (iii) every agent move does not result in location updates, (iv) location updates are done at a subset of LSs, (v) a subset of LSs are queried when a MA is to be located, (vi) the set of LSs, corresponding to a MA, for location update and find operations is dynamic, (vii) the dynamic nature of these sets helps alleviate situations of heavy burden on some LSs, when a large number of MAs are concentrated in a small geographical area. Thus, location management is done efficiently, and responsibility is shared fairly among LSs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mobile Agents for Locating Documents in Ad Hoc Networks

The wide availability of mobile devices equipped with wireless communication capabilities together with the technical possibility to form adhoc networks paves the way for building highly dynamic communities of mobile users. An interesting application in such an environment is decentralized peer-to-peer file sharing and exchanging. Locating the required files in a highly dynamic network while mi...

متن کامل

Asynchronous Service Discovery in Mobile Ad-hoc Networks

The wide availability of mobile devices equipped with wireless communication devices paves the way for building highly dynamic communities of ad-hoc networks. For an asynchronous service discovery in this environment, we suggest the use of mobile agents. Here, we concentrate on file sharing and exchanging services. We adopt a new asynchronous approach for discovering and locating these files, s...

متن کامل

Dynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)

In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...

متن کامل

Adaptive Distributed Consensus Control for a Class of Heterogeneous and Uncertain Nonlinear Multi-Agent Systems

This paper has been devoted to the design of a distributed consensus control for a class of uncertain nonlinear multi-agent systems in the strict-feedback form. The communication between the agents has been described by a directed graph. Radial-basis function neural networks have been used for the approximation of the uncertain and heterogeneous dynamics of the followers as well as the effect o...

متن کامل

Checkpointing and Rollback of Wide-area Distributed Applications using Mobile Agents

We consider the problem of designing rollback error recovery algorithms for dynamic, wide area distributed systems like the Internet. The characteristics and the scale of such a system complicate the design and performance of the algorithms. Traditional message passing based algorithms incur large overhead, in both the network traffic and message passing delay, in such a wide-area environment. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005